#include<iostream>
using namespace std;


#include"priority_queue.h"

void test_priority_queue1()
{
	bit::priority_queue<int, vector<int>, bit::greater<int>> pq;
	pq.push(3);
	pq.push(2);
	pq.push(6);
	pq.push(4);
	pq.push(1);
	pq.push(9);
	pq.push(5);
	while (!pq.empty())
	{
		cout << pq.top() << " ";
		pq.pop();
	}
	cout << endl;
}
int main()
{
	test_priority_queue1();
	return 0;
}